RAPPORT Value constraints in the CLP scheme
نویسنده
چکیده
This paper addresses the question of how to incorporate constraint propagation into logic programming. A likely candidate is the CLP scheme, which allows one to exploit algorithmic opportunities while staying within logic programming semantics. CLP(R) is an example: it combines logic programming with the algorithms for solving linear equalities and inequalities. In this paper we describe two contrasting constraint store management strategies within the CLP scheme. One leads to CLP(R), while the other, which we call value constraints, supports consistency methods such as arc consistency and interval constraints. In value constraints, the infer step of the CLP scheme is the application of a consistency operator acting on the active constraints. We show how the continued application of the infer step can be optimized and that such optimization is equivalent to the Waltz algorithm for constraint propagation. Using the Lassez-Maher xpoint theory of chaotic iterations, we show that the Waltz algorithm does not necessarily converge to a xpoint, but that it does so in the nitary case.
منابع مشابه
Hierarchical Constraint Logic Programming
Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages, as well as most other constraint systems, only allow the programmer to specify constraints that must hold. In many applications, such as interactive graphics, planning, document formatting, and decision...
متن کاملConstraint Hierarchies and Logic Programming
Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages, as well as most other constraint systems, only allow the programmer to specify constraints that must hold. In many applications, such as interactive graphics, page layout, and decision support, one need...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA Meta Constraint Logic Programming Scheme
We present a Meta Constraint Logic Programming (MCLP) general scheme. The idea behind the work concerns the possibility of building meta CLP architectures by adding CLP solvers as meta level reasoners on the constraints of the underlying object systems. In this way, we are able not only to increase the expressive power of CLP, but also to implement several constraint satisfaction techniques lik...
متن کاملCLP(H): Constraint logic programming for hedges
CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We study algebra...
متن کامل